/**
 * 二叉树：
 * 1.链式存储：常用孩子表示法
 * 2.顺序存储
 *
 */




public class TestDemo {


    public static void main(String[] args) {
        BinaryTree biTree = new BinaryTree();
        TreeNode root = biTree.CreateBinaryTree();
        biTree.PreOrderBinaryTree(root);
        System.out.println();
        biTree.inOrderBinaryTree(root);
        System.out.println();
        biTree.PostOrderBinaryTree(root);

        System.out.println();
        int ret1 = biTree.getSize(root);
        System.out.println(ret1);
        int ret2 = biTree.getSize2(root);
        System.out.println(ret2);


    }


}
